Information-Theoretic Secret Key Agreement
نویسنده
چکیده
منابع مشابه
Towards Characterizing When Information-Theoretic Secret Key Agreement Is Possible
This paper is concerned with information-theoretically secure secret key agreement in the general scenario where three parties,quence of random bits broadcast by a satellite. We consider the problem of determining for a given distribution PXY Z whether Alice and Bob can in principle, by communicating over an insecure channel accessible to Eve, generate a secret key about which Eve's information...
متن کاملInformation-theoretic key agreement of multiple terminal: part II: channel model
This is the second part of a two-part paper on information-theoretically secure secret key agreement. This paper focuses on the secret key rate problem under the channel model. In the channel model, a set of two or more terminals wish to create a shared secret key that is information-theoretically secure from an eavesdropper. The first terminal can choose a sequence of inputs to a discrete memo...
متن کاملInformation-theoretically Secure Secret-key Agreement by Not Authenticated Public Discussion 1
All information-theoretically secure key agreement protocols (e.g. based on quantum cryptography or on noisy channels) described in the literature are secure only against passive adversaries in the sense that they assume the existence of an authenticated public channel. The goal of this paper is to investigate information-theoretic security even against active adversaries with complete control ...
متن کاملInformation-Theoretic Key Agreement of Multiple Terminals - Part II: Channel Model
This is the second part of a two-part paper on information-theoretically secure secret key agreement. This part covers the secret key capacity under the channel model. In this model, multiple terminals wish to create a shared secret key that is secure from an eavesdropper with unlimited computational resources. The terminals are all connected to a noiseless and authenticated but unsecure channe...
متن کاملProvably Secure Cryptographic Constructions
Modern cryptography has virtually no provably secure constructions. Starting from the first Diffie–Hellman key agreement protocol (Diffie & Hellman, 1976) and the first public key cryptosystemRSA (Rivest et al., 1978), not a single public key cryptographic protocol has been proven secure. Note, however, that there exist secure secret key protocols, e.g., the one-time pad scheme (Shannon, 1949; ...
متن کامل